The Modeling of Milk-run Vehicle Routing Problem Based on Improved C-W Algorithm that Joined Time Window
نویسندگان
چکیده
منابع مشابه
A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملThe Time Window Assignment Vehicle Routing Problem
In many distribution networks, it is vital that time windows in which deliveries are made are assigned to customers for the long term. However, at the moment of assigning time windows demand is not known. In this paper we introduce the time window assignment vehicle routing problem, the TWAVRP. In this problem time windows have to be assigned before demand is known. Next the realization of dema...
متن کاملAn Improved Adaptive Genetic Algorithm for the Multi-depot Vehicle Routing Problem with Time Window
In order to improve the efficiency of vehicle objective, the paper addresses the problem of multi-depot vehicle routing with time window. An adaptive genetic algorithm based on the artificial bee colony algorithm is developed for the solution process of the multi-depot vehicle routing problem. The new algorithm provides not only with the strong global search capability, but also the strong loca...
متن کاملMutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization
The objective of vehicle routing problem is usually to minimize the total traveling distance or cost. But in practice, there are a lot of problems needed to minimize the fastest completion time. The milk-run vehicle routing problem (MRVRP) is widely used in milk-run distribution. The mutation ACO is given to solve MRVRP with fastest completion time in this paper. The milk-run VRP with fastest c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2017
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2017.05.453